Noncommutative Grobner basis, Hilbert series, Anick's resolution and BERGMAN under MS-DOS

نویسندگان

  • Svetlana Cojocaru
  • Victor Ufnarovski
چکیده

The definition and main results connected with Gröbner basis, Hilbert series and Anick's resolution are formulated. The method of the infinity behavior prediction of Gröbner basis in noncommu-tative case is presented. The extensions of BERGMAN package for IBM PC compatible computers are described. Let A =< X|R > be a finitely presented associative algebra over field K. Here are the main examples of algebras that will help us to illustrate some following definitions (later we will refer to them as main examples).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

BERGMAN under MS-DOS and Anick's resolution

Noncommutative algebras, defined by the generators and relations, are considered. The definition and main results connected with the Gröbner basis, Hilbert series and Anick’s resolution are formulated. Most attention is paid to universal enveloping algebras. Four main examples illustrate the main concepts and ideas. Algorithmic problems arising in the calculation of the Hilbert series are inves...

متن کامل

Constructing the Grobner basis using Anick's resolution in the noncommutative algebras

This article describes the method of construction the Gröbner basis based on the information in the Anick’s resolution.

متن کامل

Hilbert Series of Group Representations and Grbner Bases for Generic Modules

Each matrix representation P: G —> GLn(K) of a finite Group G over a field K induces an action of G on the module A over the polynomial algebra A = K [ x 1 , . . . , xn]. The graded A-submodule M(P) of A generated by the orbit of (x1, ..., xn) is studied. A decomposition of MO) into generic modules is given. Relations between the numerical invariants of P and those of M(P), the latter being eff...

متن کامل

On the computation of Hilbert series and Poincare series for algebras with infinite Grobner bases

In this paper we present algorithms to compute finite state automata which, given any rational language, recognize the languages of normal words and n-chains. We also show how these automata can be used to compute the Hilbert series and Poincaré series for any algebra with a rational set of leading words of its minimal Gröbner basis.

متن کامل

Segre Embeddings, Hilbert Series and Newcomb’s Problem

Monomial ideals and toric rings are closely related. By consider a Grobner basis we can always associated to any ideal I in a polynomial ring a monomial ideal in≺I, in some special situations the monomial ideal in≺I is square free. On the other hand given any monomial ideal I of a polynomial ring S, we can define the toric K[I] ⊂ S. In this paper we will study toric rings defined by Segre embed...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • The Computer Science Journal of Moldova

دوره 3  شماره 

صفحات  -

تاریخ انتشار 1995